Embedding the polytomic tree into the $n$-cube
نویسندگان
چکیده
منابع مشابه
On Oriented Embedding of the Dichotomic Tree into the Hypercube
We consider the oriented dichotomic tree and the oriented hypercube. The tree edges are oriented from the root to the leaves, while the orientation of the cube edges is induced by the direction from 0 to 1 in the coordinatewise form. The problem is to embed such a tree with l levels into the oriented n-cube as an oriented subgraph, for minimal possible n. A new approach to such problems is pres...
متن کاملEmbedding Cube-Connected Cycles Graphs into Faulty Hypercubes
AbstructWe consider the problem of embedding a cubeconnected cycles graph (CCC) into a hypercube with edge faults. Our main result is an algorithm that, given a l i t of faulty edges, computes an embedding of the CCC that spans all of the nodes and avoids all of the faulty edges. The algorithm has optimal running time and tolerates the maximum number of faults (in a worst-case setting). Because...
متن کاملAn Optimizing Method for Embedding Linear Graphs in N-Cube
In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code. The fundamental idea in this study is to modify a given graph iteratively in such a manner that the connecting prop...
متن کاملEmbedding of Tree Machines into Hypercubes
In this paper, we present that a tree machine can be embedded into incomplete hypercube with expansion 1, load 1, dilation 2 and congestion 2. This result is better than the expansion (2+2)/(2+2-2) in [14]. Then we consider how to embed a large tree machine into a hypercube for considering load-balance. We have shown that a tree machine TMh (h1) can be embedded into a hypercube Hh+1 with dilat...
متن کاملEmbedding of and + into Arbitrary Tree
We present an approach to find the edge congestion sum and dilation sum forembedding of square of cycle on n vertices, Cn , and Cn 2 −1 + K1 into arbitrary tree. The embedding algorithms use a technique based on consecutive label property. Our algorithm calculates edge congestion in linear time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1973
ISSN: 0528-2195
DOI: 10.21136/cpm.1973.117800